Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
نویسندگان
چکیده
منابع مشابه
A branch and bound algorithm for the maximum clique problem
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A branch and bound algorithm for unconstrained quadratic zero-one programming is given that uses a technique to dynamically select variables for the ordering of the branching tree. Dynamic variable selection is equivalent to vertex selection in a similar branch and bound ...
متن کاملSimple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of the...
متن کاملSome Improvements on Kumlander-s Maximum Weight Clique Extraction Algorithm
Some fast exact algorithms for the maximum weight clique problem have been proposed. Östergård’s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that the straightforwardly implemented Kumlander’s algorithm is slower than Östergård’s algorithm. We propose some improvements on Kumlander’s algorithm. Keywords—Maximum weight clique, exact algorithm, branch...
متن کاملA Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Many problems can be formulated as maximum clique problems. Hence, it is highly important to develop algorithms that can find a maximum clique very fast in practice. We propose new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR (J. Global Optim., 37, pp.95–111, 2007), previously shown to be the fastest maximum-clique-f...
متن کاملA Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
The maximum labelled clique problem is a variant of the maximum clique problemwhere edges in the graph are given labels, and we are not allowed to use more than a certain number of distinct labels in a solution. We introduce a new branch-andbound algorithm for the problem, and explain how it may be parallelised. We evaluate an implementation on a set of benchmark instances, and show that it is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.01.026